Goto

Collaborating Authors

 wiretap channel


Feedback Lunch: Deep Feedback Codes for Wiretap Channels

arXiv.org Artificial Intelligence

Abstract--We consider reversely-degraded wiretap channels, for which the secrecy capacity is zero if there is no channel feedback. This work focuses on a seeded modular code design for the Gaussian wiretap channel with channel output feedback, combining universal hash functions for security and learned feedback-based codes for reliability to achieve positive secrecy rates. We study the trade-off between communication reliability and information leakage, illustrating that feedback enables agreeing on a secret key shared between legitimate parties, overcoming the security advantage of the wiretapper . Our findings also motivate code designs for sensing-assisted secure communication, to be used in next-generation integrated sensing and communication methods. ECURE communication can be achieved through key-based cryptography, which relies on securely-shared secret keys, and physical-layer security (PLS), which leverages the physical properties of the channel to ensure data confidentiality [1], [2].


Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation

arXiv.org Artificial Intelligence

We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy constraints in our code design. Specifically, we handle the reliability constraint via an autoencoder, and handle the secrecy constraint with hash functions. For blocklengths smaller than or equal to 128, we evaluate through simulations the probability of error at the legitimate receiver and the leakage at the eavesdropper for our code construction. This leakage is defined as the mutual information between the confidential message and the eavesdropper's channel observations, and is empirically measured via a neural network-based mutual information estimator. Our simulation results provide examples of codes with positive secrecy rates that outperform the best known achievable secrecy rates obtained non-constructively for the Gaussian wiretap channel. Additionally, we show that our code design is suitable for the compound and arbitrarily varying Gaussian wiretap channels, for which the channel statistics are not perfectly known but only known to belong to a pre-specified uncertainty set. These models not only capture uncertainty related to channel statistics estimation, but also scenarios where the eavesdropper jams the legitimate transmission or influences its own channel statistics by changing its location.


Privacy-Aware Communication Over the Wiretap Channel with Generative Networks

arXiv.org Machine Learning

We study privacy-aware communication over a wiretap channel using end-to-end learning. Alice wants to transmit a source signal to Bob over a binary symmetric channel, while passive eavesdropper Eve tries to infer some sensitive attribute of Alice's source based on its overheard signal. Since we usually do not have access to true distributions, we propose a data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC). We show through simulations with the colored MNIST dataset that our approach provides high reconstruction quality at the receiver while confusing the eavesdropper about the latent sensitive attribute, which consists of the color and thickness of the digits. Finally, we consider a parallel-channel scenario, and show that our approach arranges the information transmission such that the channels with higher noise levels at the eavesdropper carry the sensitive information, while the non-sensitive information is transmitted over more vulnerable channels.


Dual MINE-based Neural Secure Communications under Gaussian Wiretap Channel

arXiv.org Machine Learning

Recently, some researches are devoted to the topic of end-to-end learning a physical layer secure communication system based on autoencoder under Gaussian wiretap channel. However, in those works, the reliability and security of the encoder model were learned through necessary decoding outputs of not only legitimate receiver but also the eavesdropper. In fact, the assumption of known eavesdropper's decoder or its output is not practical. To address this issue, in this paper we propose a dual mutual information neural estimation (MINE) based neural secure communications model. The security constraints of this method is constructed only with the input and output signal samples of the legal and eavesdropper channels and benefit that training the encoder is completely independent of the decoder. Moreover, since the design of secure coding does not rely on the eavesdropper's decoding results, the security performance would not be affected by the eavesdropper's decoding means. Numerical results show that the performance of our model is guaranteed whether the eavesdropper learns the decoder himself or uses the legal decoder.


Multi-Objective DNN-based Precoder for MIMO Communications

arXiv.org Machine Learning

This paper introduces a unified deep neural network (DNN)-based precoder for two-user multiple-input multiple-output (MIMO) networks with five objectives: data transmission, energy harvesting, simultaneous wireless information and power transfer, physical layer (PHY) security, and multicasting. First, a rotation-based precoding is developed to solve the above problems independently. Rotation-based precoding is new precoding and power allocation that beats existing solutions in PHY security and multicasting and is reliable in different antenna settings. Next, a DNN-based precoder is designed to unify the solution for all objectives. The proposed DNN concurrently learns the solutions given by conventional methods, i.e., analytical or rotation-based solutions. A binary vector is designed as an input feature to distinguish the objectives. Numerical results demonstrate that, compared to the conventional solutions, the proposed DNN-based precoder reduces on-the-fly computational complexity more than an order of magnitude while reaching near-optimal performance (99.45\% of the averaged optimal solutions). The new precoder is also more robust to the variations of the numbers of antennas at the receivers.


Learning End-to-End Codes for the BPSK-constrained Gaussian Wiretap Channel

arXiv.org Machine Learning

Finite-length codes are learned for the Gaussian wiretap channel in an end-to-end manner assuming that the communication parties are equipped with deep neural networks (DNNs), and communicate through binary phase-shift keying (BPSK) modulation scheme. The goal is to find codes via DNNs which allow a pair of transmitter and receiver to communicate reliably and securely in the presence of an adversary aiming at decoding the secret messages. Following the information-theoretic secrecy principles, the security is evaluated in terms of mutual information utilizing a deep learning tool called MINE (mutual information neural estimation). System performance is evaluated for different DNN architectures, designed based on the existing secure coding schemes, at the transmitter. Numerical results demonstrate that the legitimate parties can indeed establish a secure transmission in this setting as the learned codes achieve points on almost the boundary of the equivocation region. I. INTRODUCTION Physical layer (PHY) security has been put forth as an alternative/aid to the higher-layer security approaches including cryptography in order to relieve the burden placed by them upon the communication systems in various ways. Wiretap channel [1] is a widely-known theoretical model for studying PHY security from an information-theoretic perspective. The importance of achieving physical layer security for this model through finite alphabet signaling like binary phase-shift keying (BPSK) modulation is highlighted in many works [1], [2]. Several works have studied this channel and designed coding schemes to ensure security for that. Specifically, the authors in [3] have proposed an encoding technique called scrambling which could result in BERs very close to 0.5 for the eavesdropper (Eve) through error propagation, while ensuring a A. Nooraiepour is with WINLAB, Department of Electrical and Computer Engineering, Rutgers University, NJ, USA. S. Rezaei Aghdam is with the Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden (emails: alireza.nooraiepour@rutgers.edu, sinar@chalmers.se).